Matrix Representations of Artin Groups
نویسندگان
چکیده
منابع مشابه
Self-dual Artin Representations
Functional equations in number theory are relations between an L-function and some sort of dual L-function, and in general, the L-function and its dual need not coincide. For example, if χ is a primitive Dirichlet character then the functional equation relates L(s, χ) to L(1− s, χ), and L(s, χ) = L(s, χ) if and only if χ = 1. Or if f is a primitive cusp form of weight two for Γ1(N) and f∨ is th...
متن کاملInjections of Artin Groups
We study those Artin groups which, modulo their centers, are finite index subgroups of the mapping class group of a punctured sphere. In particular, we show that any injective homomorphism between these groups is parameterized by a homeomorphism of a punctured disk together with a homomorphism to the integers. The technique, following Ivanov, is to prove that every superinjective map of the com...
متن کاملArtin Groups and Coxeter Groups
where the words on each side of these relations are sequences of mij letters where ai and aj alternate in the sequence. The matrix of values mij is a Coxeter matrix M = (mij)i,j∈I on I. These groups generalize the braid groups established in 1925 by E. Artin in a natural way and therefore we suggest naming them Artin groups. If one adds the relations ai = 1 to the relations in the presentation ...
متن کاملRepresentations of Surface Groups and Right-Angled Artin Groups in Higher-Rank
We give very flexible, concrete constructions of discrete and faithful representations of right-angled Artin groups into higher-rank Lie groups. Using the geometry of the associated symmetric spaces and the combinatorics of the groups, we find a general criterion for when discrete and faithful representations exist, and show that the criterion is satisfied in particular cases. There are direct ...
متن کاملConstructing Matrix Representations of Finitely Presented Groups
The Todd-Coxeter coset enumeration algorithm is one of the most powerful tools of computational group theory. It may be viewed as a means of constructing permutation representations of nitely presented groups. In this paper we present an analogous algorithm for directly constructing matrix representations over many elds. In fact the algorithm is more general than this, and can be used to constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1988
ISSN: 0002-9939
DOI: 10.2307/2047526